Vérification et dépliages de réseaux de Petri temporels paramétrés. (Model-checking and unfoldings of parametric time Petri nets)
نویسنده
چکیده
The research works presented concern the study of parameterized verificationmethods for real time systems. The aim is to propose formal methods that can be appliedon systems whose specifications are not yet completely defined. To that end, parameters areintroduced into the formal models in order to add some degrees of freedom. The goal is thento guide the conception of the system by computing the admissible values of the parameters.We have focused on the temporal parameters that are in general among the most difficultto determine. It led us to define the model of parametric time Petri nets with stopwatches.In a first approach, we extend the classical analysis methods used for time Petri nets.First, we define the parametric state-class graph to represent the state-space of a parametricmodel. Then, it allows us to develop semi-algorithms for parametric model-checking, withwhich we can verify parametric TCTL formulae.The second approach we have followed is the study of methods that preserve the naturalconcurrency of Petri nets. The goal is to limit the combinatory explosion that appears whenchecking distributed systems, especially when parametric models are considered. To that end,we propose to compute the parametric time unfolding of the parametric net. This unfoldingis in general infinite, but we propose as an application to solve a supervision problem. In thiscontext, the construction of the unfolding is guided by finite observations, and we can extractthe explanations of these observations, as well as the constraints on the parameters that theyinduce.
منابع مشابه
Sémantique concurrente symbolique des réseaux de Petri saufs et dépliages finis des réseaux temporels
On considère des réseaux de Petri colorés, à contraintes linéaires et pouvant posséder des arcs de lecture. Sur cette classe, on définit une sémantique concurrente en termes de processus d’ordre partiel permettant de garder explicite l’indépendance entre des tirs de transitions. L’ensemble des processus peut être représenté en utilisant la notion de dépliage symbolique. Nous montrons alors comm...
متن کاملVers l'utilisation des réseaux de Petri temporels étendus pour la vérification de systèmes temps-réel décrits en RT-LOTOS
متن کامل
Verification based on unfoldings of Petri nets with read arcs. (Vérification à l'aide de dépliages de réseaux de Petri étendus avec des arcs de lecture)
Humans make mistakes, especially when faced to complex tasks, such as the construction of modern hardware or software. This thesis focuses on machine-assisted techniques to guarantee that computers behave correctly. Modern computer systems are large and complex. Automated formal verification stands as an alternative to testing or simulation to ensuring their reliability. It essentially proposes...
متن کاملVérification par model-checking de systèmes hybrides objets-règles
RÉSUMÉ. Un nombre croissant d’approches mixtes combinent programmation à base de règles et programmation orientée objets. La vérification des programmes hybrides à base d’objets et de règles est devenue un problème de plus en plus urgent à résoudre. Les méthodes de vérification existantes, développées soit pour les programmes orientés objets soit pour les systèmes de règles classiques, ne sont ...
متن کاملDependability Analysis of Control Systems using SystemC and Statistical Model Checking
Stochastic Petri nets are commonly used for modeling distributed systems in order to study their performance and dependability. This paper proposes a realization of stochastic Petri nets in SystemC for modeling large embedded control systems. Then statistical model checking is used to analyze the dependability of the constructed model. Our verification framework allows users to express a wide r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009